Families of Vicious Walkers
نویسندگان
چکیده
We consider a generalisation of the vicious walker problem in which N random walkers in R are grouped into p families. Using field-theoretic renormalisation group methods we calculate the asymptotic behaviour of the probability that no pairs of walkers from different families have met up to time t. For d > 2, this is constant, but for d < 2 it decays as a power t, which we compute to O(ε) in an expansion in ε = 2−d. The second order term depends on the ratios of the diffusivities of the different families. In two dimensions, we find a logarithmic decay (ln t), and compute ᾱ exactly.
منابع مشابه
A Reflection Principle for Three Vicious Walkers
We establish a reflection principle for three lattice walkers and use this principle to reduce the enumeration of the configurations of three vicious walkers to that of configurations of two vicious walkers. In the combinatorial treatment of two vicious walkers, we make connections to two-chain watermelons and to the classical ballot problem. Precisely, the reflection principle leads to a bijec...
متن کاملLattice paths: vicious walkers and friendly walkers
In an earlier paper [4] the problem of vicious random walkers on a d-dimensional directed lattice was considered. \Vicious walkers" describes the situation in which two or more walkers arriving at the same lattice site annihilate one another. Accordingly, the only allowed con gurations are those in which contacts are forbidden. Alternatively expressed as a static rather than dynamic problem, vi...
متن کاملVicious Walkers, Friendly Walkers and Young Tableaux Ii: with a Wall
We derive new results for the number of star and watermelon configurations of vicious walkers in the presence of an impenetrable wall by showing that these follow from standard results in the theory of Young tableaux, and combinatorial descriptions of symmetric functions. For the problem of n-friendly walkers, we derive exact asymptotics for the number of stars and watermelons both in the absen...
متن کاملVicious Walkers and Hook Young Tableaux
We consider a generalization of the vicious walker model. Using a bijection map between the path configuration of the non-intersecting random walkers and the hook Young diagram, we compute the probability concerning the number of walker’s movements. Applying the saddle point method, we reveal that the scaling limit gives the Tracy–Widom distribution, which is same with the limit distribution of...
متن کاملVicious Random Walkers and a Discretization of Gaussian Random Matrix Ensembles
The vicious random walker problem on a one dimensional lattice is considered. Many walkers take simultaneous steps on the lattice and the configurations in which two of them arrive at the same site are prohibited. It is known that the probability distribution of N walkers after M steps can be written in a determinant form. Using an integration technique borrowed from the theory of random matric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008